منابع مشابه
An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملAn investigation of representations of combinatorial auctions
Combinatorial auctions (CAs) are an important mechanism for allocating multiple goods while allowing self-interested agents to specify preferences over bundles of items. Winner determination for a CA is known to be NP-complete. However, restricting the problem can allow us to solve winner determination in polynomial time. These restrictions sometimes apply to the CA’s representation. There are ...
متن کاملAn Experimental Comparison of Combinatorial Procurement Auctions
The need for new procurement auction mechanisms that allow for rich bid types such as bundle bids on multiple items has been raised in many situations in industrial procurement. In addition to strategic problems, the design of these combinatorial auctions exhibits hard computational problems. For example, the winner determination typically leads to NP-hard allocation problems in combinatorial a...
متن کاملAn Algorithm for Multi-Unit Combinatorial Auctions
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously published algorithms are limited to single-unit CAs, already a hard computational problem. In contrast, here we address the more general problem in which each good may have multiple units, and each bid specifies an unr...
متن کاملMulti-Unit Combinatorial Auctions: an Exact Approach
In recent times combinatorial auctions have become an interesting domain for theoretical and applied developments of the electronic market technology. A combinatorial auction allows the simultaneous selling of several items and each participant to the auction may bid for bundles of items. When items in a bid are all different the auction is said a Single Unit Combinatorial Auction (SUCA), while...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGecom Exchanges
سال: 2007
ISSN: 1551-9031,1551-9031
DOI: 10.1145/1345037.1345039